//
// Created by Administrator on 2021/11/25.
// May Saint Diana bless you!
//
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <climits>

using namespace std;

class Solution {
public:
    int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
        // 一只猪，在n轮的测试中，可以最多表现出n+1种信息，用n+1进制表示在第几轮的状态
        // 一只猪表示一个n+1进制位
        // 整个测试过程，能够实现的总信息量为 (n+1)^m m为猪的数量
        int rounds = minutesToTest / minutesToDie;
        int base = rounds + 1;
        int pigs = ceil(log(buckets) / log(base));
        return pigs;
    }
};

int main() {
    Solution solution;
    cout << solution.poorPigs(1000, 15, 60) << endl;
    return 0;
}
